Point Cloud Repair Method via Convex Set Theory

نویسندگان

چکیده

The point cloud is the basis for 3D object surface reconstruction. An incomplete significantly reduces accuracy of downstream work such as reconstruction and recognition. Therefore, point-cloud repair indispensable work. However, original shape difficult to restore due uncertainty position new filling point. Considering advantages convex set in dealing with problems, we propose a method via that transforms problem into construction set. core idea proposed discretize hole boundary area multiple subunits add points specific subunit according properties Specific must be located area. For selection subunit, introduced Markov random fields (MRF) transform them maximal posteriori (MAP) estimation field labels. Variational inference was used approximate MAP calculate needed points. Our iteratively selects adds With increasing number iterations, gradually move center region until completely repaired. quantitative qualitative results experiments demonstrate our superior compared method.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Green Enrichment Method of Copper, Manganese and Nickel in Water Samples via Cloud Point Extraction

A new, cost-effective, and environmental-friendly cloud point extraction methodology was described for enrichment of copper, manganese and nickel in several water samples. The method involves the complexation of copper, manganese or nickel with 2-amino-6-(1,3-thiazol-2-diazeyl)-phenol at pH 7.0, then extraction into Triton X-114. After dilution of the surfactant-rich phase with acidified methan...

متن کامل

Level Set Equations on Surfaces via the Closest Point Method

Level set methods have been used in a great number of applications in R and R and it is natural to consider extending some of these methods to problems defined on surfaces embedded in R or higher dimensions. In this paper we consider the treatment of level set equations on surfaces via a recent technique for solving partial differential equations (PDEs) on surfaces, the Closest Point Method [RM...

متن کامل

Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping

The existing algorithms for solving the convex minimization problem over the fixed point set of a nonexpansive mapping on a Hilbert space are based on algorithmic methods, such as the steepest descent method and conjugate gradient methods, for finding a minimizer of the objective function over the whole space, and attach importance to minimizing the objective function as quickly as possible. Me...

متن کامل

Point Cloud Segmentation to Approximately Convex Surfaces for Fruit Recognition

A fruit recognition approach based on segmenting the point cloud acquired by a 3D camera into approximately convex surfaces is considered. A segmentation approach which transforms a depth image into a triangular mesh and then segments this mesh into approximately convex segments is applied to depth images of fruits on trees. An analysis of the results obtained by this approach is performed with...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied sciences

سال: 2023

ISSN: ['2076-3417']

DOI: https://doi.org/10.3390/app13031830